Complex Diierential Games of Pursuit-evasion Type with State Constraints, Part 2: Numerical Computation of Optimal Open-loop Strategies
نویسندگان
چکیده
B Abstract. In Part 1 of this paper (Ref. 1) necessary conditions for optimal open-loop strategies in diierential games of pursuit-evasion type have been developed for problems which involve state variable inequality constraints and nonsmooth data. These necessary conditions lead to multipoint boundary-value problems with jump conditions. These problems can be solved very eeciently and accurately by the well-known multiple shooting method. By this approach optimal open-loop strategies and their associated saddle-point trajectories can be computed for the entire capture zone of the game. This also includes the computation of optimal open-loop strategies and saddle-point trajectories on the barrier of the pursuit-evasion game. The open-loop strategies provide an open-loop representation of the optimal feedback strategies. Numerical results are obtained for a special air combat scenario between one medium range air-to-air missile and one high performance aircraft in a vertical plane. A dynamic pressure limit for the aircraft imposes a state variable inequality constraint of the rst order. Special emphasis is laid on realistic approximations of the lift, the drag and the thrust of both vehicles, and of the atmospheric data. In particular, saddle-point trajectories on the barrier are computed and discussed. Submanifolds of the barrier which separate the initial values of the capture zone from those of the escape zone are computed for two representative launch positions of the missile. By this way, the ring range of the pursuing missile is determined and visualized.
منابع مشابه
Complex Diierential Games of Pursuit-evasion Type with State Constraints, Part 1: Necessary Conditions for Optimal Open-loop Strategies
B Abstract. Complex pursuit-evasion games with state variable inequality constraints are investigated. Necessary conditions of the rst and the second order for optimal trajectories are developed, which enable the calculation of optimal open-loop strategies. The necessary conditions on singular surfaces induced by state constraints and nonsmooth data are discussed in detail. These conditions lea...
متن کاملComplex Differential Games of Pursuit-Evasion Type with State Constraints, Part 1: Necessary Conditions for Optimal Open-Loop Strategies
Complex pursuit-evasion games with state variable inequality constraints are investigated. Necessary conditions of the first and the second order for optimal trajectories are developed, which enable the calculation of optimal open-loop strategies. The necessary conditions on singular surfaces induced by state constraints and nonsmooth data are discussed in detail. These conditions lead to multi...
متن کاملComplex Differential Games of Pursuit-Evasion Type with State Constraints, Part 2: Numerical Computation of Optimal Open-Loop Strategies
In Part 1 of this paper (Ref. 1), necessary conditions for optimal open-loop strategies in differential games of pursuit-evasion type have been developed for problems which involve state variable inequality constraints and nonsmooth data. These necessary conditions lead to multipoint boundary-value problems with jump conditions. These problems can be solved very efficiently and accurately by th...
متن کاملSolving Optimal Control and Pursuit-evasion Game Problems of High Complexity
Optimal control problems which describe realistic technical applications exhibit various features of complexity. First, the consideration of inequality constraints leads to optimal solutions with highly complex switching structures including bang-bang, singular, and control-and state-constrained sub-arcs. In addition, also isolated boundary points may occur. Techniques are surveyed for the comp...
متن کاملIncremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
Pursuit-evasion games have been used for modeling various forms of conflict arising between two agents modeled as dynamical systems. Although analytical solutions of some simple pursuit-evasion games are known, most interesting instances can only be solved using numerical methods requiring significant offline computation. In this paper, a novel incremental sampling-based algorithm is presented ...
متن کامل